Quadrangular embeddings of the complete even k-partite graph
نویسندگان
چکیده
منابع مشابه
Quadrangular embeddings of complete graphs∗
Hartsfield and Ringel proved that a complete graph Kn has an orientable quadrangular embedding if n ≡ 5 (mod 8), and has a nonorientable quadrangular embedding if n ≥ 9 and n ≡ 1 (mod 4). We complete the characterization of complete graphs admitting quadrangular embeddings by showing that Kn has an orientable quadrilateral embedding if n ≡ 0 (mod 8), and has a nonorientable quadrilateral embedd...
متن کاملSpanners of Complete k -Partite Geometric Graphs
We address the following problem: Given a complete k-partite geometric graph K whose vertex set is a set of n points in R, compute a spanner of K that has a “small” stretch factor and “few” edges. We present two algorithms for this problem. The first algorithm computes a (5 + )-spanner of K with O(n) edges in O(n log n) time. The second algorithm computes a (3 + )-spanner of K with O(n log n) e...
متن کاملDoubly Even Orientable Closed 2-cell Embeddings of the Complete Graph
For all m > 1 and k > 2, we construct closed 2-cell embeddings of the complete graph K8km+4k+1 with faces of size 4k in orientable surfaces. Moreover, we show that when k > 3 there are at least (2m − 1)!/2(2m + 1) = 22mlog2m−O(m) nonisomorphic embeddings of this type. We also show that when k = 2 there are at least 1 4π 1 2m− 5 4 ( 4m e2 ) √ m (1− o(1)) nonisomorphic embeddings of this type.
متن کاملDifferentially Expressed Functional Connectivity Networks with K-partite Graph Topology
Emerging brain network studies suggest that interactions between various distributed neuronal populations may be characterized by an organized complex topological structure. Many brain diseases are associated with altered topological patterns of brain connectivity. Therefore, a key inquiry of connectivity analysis is to identify network-level differentially expressed connections that have low f...
متن کاملLearning from networked examples in a k-partite graph
Many machine learning algorithms are based on the assumption that training examples are drawn independently. However, this assumption does not hold anymore when learning from a networked examples, i.e. examples sharing pieces of information (such as vertices or edges). We propose an efficient weighting method for learning from networked examples and show a sample error bound which is better tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90175-h